Analysis of Short Blocklength Codes for Secrecy

نویسندگان

  • Willie K. Harrison
  • Dinis Sarmento
  • João P. Vilela
  • Marco Gomes
چکیده

In this paper we provide secrecy metrics applicable to physical-layer coding techniques with finite blocklengths over Gaussian and fading wiretap channel models. Our metrics go beyond some of the known practical secrecy measures, such as bit error rate and security gap, so as to make lower bound probabilistic guarantees on error rates over short blocklengths both preceding and following a secrecy decoder. Our techniques are especially useful in cases where application of traditional information-theoretic security measures is either impractical or simply not yet understood. The metrics can aid both practical system analysis, and practical system design for physical-layer security codes. Furthermore, these new measures fill a void in the current landscape of practical security measures for physicallayer security coding, and may assist in the wide-scale adoption of physical-layer techniques for security in real-world systems. We also show how the new metrics provide techniques for reducing realistic channel models to simpler discrete memoryless wiretap channel equivalents over which existing secrecy code designs may achieve information-theoretic security. EDICS Category: COM-OTHS, INF-SECC

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wiretap Channels: Nonasymptotic Fundamental Limits

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact secondorder...

متن کامل

Asymptotic and Finite-length Optimization of Ldpc Codes

This thesis addresses the problem of information transmission over noisy channels. In 1993, Berrou, Glavieux and Thitimajshima discovered Turbo-codes. These codes made it possible to achieve a very good performance at low decoding complexity. In hindsight, it was recognized that the underlying principle of using sparse graph codes in conjunction with message-passing decoding was the same as the...

متن کامل

Gallager Codes for High Rate Applications

Gallager codes with large block length and low rate (e.g., N ' 10, 000–40, 000, R ' 0.25–0.5) have been shown to have recordbreaking performance for low signal-to-noise applications. Gallager codes with high rates (R ' 0.8–0.94) are also excellent, outperforming comparable BCH and Reed-Solomon codes, even at short blocklength (N ' 2, 000–4, 000) (MacKay and Davey, 2000). This paper looks in mor...

متن کامل

A Unified Approach to Gaussian Channels with Finite Blocklength

by Ebrahim MolavianJazi Among the emerging trends in the wireless industry, the Internet of Things (IoT) and machine-to-machine (M2M) communications are notable examples that prompt power efficient communication schemes that can communicate short packets of timesensitive control information with very low latency. A mathematical analysis and design of networks with such stringent latency require...

متن کامل

Lengthening and Extending Binary Private Information Retrieval Codes

It was recently shown by Fazeli et al. that the storage overhead of a traditional t-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a t-server PIR code. In this work, we show that a family of tserver PIR codes (with increasing dimensions and blocklengths) can be constructed from an existing t-server PIR code through lengthening by a single i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1509.07092  شماره 

صفحات  -

تاریخ انتشار 2015